By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 13, Issue 3, pp. 281-418

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler

Michel X. Goemans and David P. Williamson

pp. 281-294

BibTeX  Abstract Full Text:  PDF

The Size of a Graph Without Topological Complete Subgraphs

M. Cera, A. Diánez, and A. Márquez

pp. 295-301

BibTeX  Abstract Full Text:  PDF

Evaluation, Strength, and Relevance of Variables of Boolean Functions

Peter L. Hammer, Alexander Kogan, and Uriel G. Rothblum

pp. 302-312

BibTeX  Abstract Full Text:  PDF

A Tight Bound on the Irregularity Strength of Graphs

Till Nierhoff

pp. 313-323

BibTeX  Abstract Full Text:  PDF

Computing Functions of a Shared Secret

Amos Beimel, Mike Burmester, Yvo Desmedt, and Eyal Kushilevitz

pp. 324-345

BibTeX  Abstract Full Text:  PDF

An Optimization Problem in Statistical Databases

Ljiljana Brankovic, Peter Horak, and Mirka Miller

pp. 346-353

BibTeX  Abstract Full Text:  PDF

The Graph of Linear Extensions Revisited

Michael Naatz

pp. 354-369

BibTeX  Abstract Full Text:  PDF

The Online Transportation Problem

Bala Kalyanasundaram and Kirk R. Pruhs

pp. 370-383

BibTeX  Abstract Full Text:  PDF

Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings

E. G. Coffman, Jr., C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, and M. Yannakakis

pp. 384-402

BibTeX  Abstract Full Text:  PDF

The Capacitated K-Center Problem

Samir Khuller and Yoram J. Sussmann

pp. 403-418

BibTeX  Abstract Full Text:  PDF